The incremental unknown method II
نویسندگان
چکیده
منابع مشابه
Qualitative behaviour of solutions of Signorini problem with perturbing the unknown boundary : II. The multigrid method
Computational method for the Signorini problem in 2D is presented. Using qualitative properties of the solution on a perturbed boundary the iteration method for ®nding of the unknown boundary Cc is constructed. In the ®rst part of the method the boundary ac oCc is localized within two mesh points of a ®xed FE mesh. In the second part introducing the new multigrid algorithm the value ac is acc...
متن کاملIncremental Sensor Fusion in Factor Graphs with Unknown Delays
Sensor fusion by incremental smoothing in factor graphs allows the easy incorporation of asynchronous and delayed measurements, which is one of the main advantages of this approach compared to the ubiquitous filtering techniques. While incorporating delayed measurements into the factor graph representation is in principle easy when the delay is known, handling unknown delays is a non-trivial ta...
متن کاملPath-Adaptive A* for Incremental Heuristic Search in Unknown Terrain
Adaptive A* is an incremental version of A* that updates the h-values of the previous A* search to make them more informed and thus future A* searches more focused. In this paper, we show how the A* searches performed by Adaptive A* can reuse part of the path of the previous search and terminate before they expand a goal state, resulting in Path-Adaptive A*. We demonstrate experimentally that P...
متن کاملIncremental Predictive Command of Velocity to Be Gained Guidance Method
In this paper, a new incremental predictive guidance method based on implicit form of velocity to be gained algorithm is proposed. In this approach, the generalized incremental predictive control (GIPC) approach is applied to the linearized model for compensating the guidance error. Instead of using the present state in popular model based predictive controller (MPC), in the new method both pre...
متن کاملIncremental kernel PCA and the Nyström method
Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is more computationally efficient than comparable existing algorithms. We extend o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1991
ISSN: 0893-9659
DOI: 10.1016/0893-9659(91)90041-s